251 research outputs found

    Analysis, Visualization, and Transformation of Audio Signals Using Dictionary-based Methods

    Get PDF
    date-added: 2014-01-07 09:15:58 +0000 date-modified: 2014-01-07 09:15:58 +0000date-added: 2014-01-07 09:15:58 +0000 date-modified: 2014-01-07 09:15:58 +000

    Using the Memories of Multiscale Machines to Characterize Complex Systems

    Full text link
    A scheme is presented to extract detailed dynamical signatures from successive measurements of complex systems. Relative entropy based time series tools are used to quantify the gain in predictive power of increasing past knowledge. By lossy compression, data is represented by increasingly coarsened symbolic strings. Each compression resolution is modeled by a machine: a finite memory transition matrix. Applying the relative entropy tools to each machine's memory exposes correlations within many time scales. Examples are given for cardiac arrhythmias and different heart conditions are distinguished.Comment: 4 pages, 2 figure

    A novel semi-fragile forensic watermarking scheme for remote sensing images

    Get PDF
    Peer-reviewedA semi-fragile watermarking scheme for multiple band images is presented. We propose to embed a mark into remote sensing images applying a tree structured vector quantization approach to the pixel signatures, instead of processing each band separately. The signature of themmultispectral or hyperspectral image is used to embed the mark in it order to detect any significant modification of the original image. The image is segmented into threedimensional blocks and a tree structured vector quantizer is built for each block. These trees are manipulated using an iterative algorithm until the resulting block satisfies a required criterion which establishes the embedded mark. The method is shown to be able to preserve the mark under lossy compression (above a given threshold) but, at the same time, it detects possibly forged blocks and their position in the whole image.Se presenta un esquema de marcas de agua semi-frágiles para múltiples imágenes de banda. Proponemos incorporar una marca en imágenes de detección remota, aplicando un enfoque de cuantización del vector de árbol estructurado con las definiciones de píxel, en lugar de procesar cada banda por separado. La firma de la imagen hiperespectral se utiliza para insertar la marca en el mismo orden para detectar cualquier modificación significativa de la imagen original. La imagen es segmentada en bloques tridimensionales y un cuantificador de vector de estructura de árbol se construye para cada bloque. Estos árboles son manipulados utilizando un algoritmo iteractivo hasta que el bloque resultante satisface un criterio necesario que establece la marca incrustada. El método se muestra para poder preservar la marca bajo compresión con pérdida (por encima de un umbral establecido) pero, al mismo tiempo, detecta posiblemente bloques forjados y su posición en la imagen entera.Es presenta un esquema de marques d'aigua semi-fràgils per a múltiples imatges de banda. Proposem incorporar una marca en imatges de detecció remota, aplicant un enfocament de quantització del vector d'arbre estructurat amb les definicions de píxel, en lloc de processar cada banda per separat. La signatura de la imatge hiperespectral s'utilitza per inserir la marca en el mateix ordre per detectar qualsevol modificació significativa de la imatge original. La imatge és segmentada en blocs tridimensionals i un quantificador de vector d'estructura d'arbre es construeix per a cada bloc. Aquests arbres són manipulats utilitzant un algoritme iteractiu fins que el bloc resultant satisfà un criteri necessari que estableix la marca incrustada. El mètode es mostra per poder preservar la marca sota compressió amb pèrdua (per sobre d'un llindar establert) però, al mateix temps, detecta possiblement blocs forjats i la seva posició en la imatge sencera

    Some recent developments in quantization of fractal measures

    Full text link
    We give an overview on the quantization problem for fractal measures, including some related results and methods which have been developed in the last decades. Based on the work of Graf and Luschgy, we propose a three-step procedure to estimate the quantization errors. We survey some recent progress, which makes use of this procedure, including the quantization for self-affine measures, Markov-type measures on graph-directed fractals, and product measures on multiscale Moran sets. Several open problems are mentioned.Comment: 13 page

    Quadratic optimal functional quantization of stochastic processes and numerical applications

    Get PDF
    In this paper, we present an overview of the recent developments of functional quantization of stochastic processes, with an emphasis on the quadratic case. Functional quantization is a way to approximate a process, viewed as a Hilbert-valued random variable, using a nearest neighbour projection on a finite codebook. A special emphasis is made on the computational aspects and the numerical applications, in particular the pricing of some path-dependent European options.Comment: 41 page

    Representing complex data using localized principal components with application to astronomical data

    Full text link
    Often the relation between the variables constituting a multivariate data space might be characterized by one or more of the terms: ``nonlinear'', ``branched'', ``disconnected'', ``bended'', ``curved'', ``heterogeneous'', or, more general, ``complex''. In these cases, simple principal component analysis (PCA) as a tool for dimension reduction can fail badly. Of the many alternative approaches proposed so far, local approximations of PCA are among the most promising. This paper will give a short review of localized versions of PCA, focusing on local principal curves and local partitioning algorithms. Furthermore we discuss projections other than the local principal components. When performing local dimension reduction for regression or classification problems it is important to focus not only on the manifold structure of the covariates, but also on the response variable(s). Local principal components only achieve the former, whereas localized regression approaches concentrate on the latter. Local projection directions derived from the partial least squares (PLS) algorithm offer an interesting trade-off between these two objectives. We apply these methods to several real data sets. In particular, we consider simulated astrophysical data from the future Galactic survey mission Gaia.Comment: 25 pages. In "Principal Manifolds for Data Visualization and Dimension Reduction", A. Gorban, B. Kegl, D. Wunsch, and A. Zinovyev (eds), Lecture Notes in Computational Science and Engineering, Springer, 2007, pp. 180--204, http://www.springer.com/dal/home/generic/search/results?SGWID=1-40109-22-173750210-

    A new multistage lattice vector quantization with adaptive subband thresholding for image compression

    Get PDF
    Lattice vector quantization (LVQ) reduces coding complexity and computation due to its regular structure. A new multistage LVQ (MLVQ) using an adaptive subband thresholding technique is presented and applied to image compression. The technique concentrates on reducing the quantization error of the quantized vectors by "blowing out" the residual quantization errors with an LVQ scale factor. The significant coefficients of each subband are identified using an optimum adaptive thresholding scheme for each subband. A variable length coding procedure using Golomb codes is used to compress the codebook index which produces a very efficient and fast technique for entropy coding. Experimental results using the MLVQ are shown to be significantly better than JPEG 2000 and the recent VQ techniques for various test images

    Interaction of Imidazole Containing Hydroxamic Acids with Fe(III): Hydroxamate Versus Imidazole Coordination of the Ligands

    Get PDF
    Solution equilibrium studies on Fe(III) complexes formed with imidazole-4-carbohydroxamic acid (Im-4-Cha), N-Me-imidazole-4-carbohydroxamic acid (N-Me-Im-4-Cha), imidazole-4-acetohydroxamic acid (Im-4-Aha), and histidinehydroxamic acid (Hisha) have been performed by using pH-potentiometry, UV-visible spectrophotometry, EPR, ESI-MS, and H1-NMR methods. All of the obtained results demonstrate that the imidazole moiety is able to play an important role very often in the interaction with Fe(III), even if this metal ion prefers the hydroxamate chelates very much. If the imidazole moiety is in α-position to the hydroxamic one (Im-4-Cha and N-Me-Im-4-Cha) its coordination to the metal ion is indicated unambiguously by our results. Interestingly, parallel formation of (Nimidazole, Ohydroxamate), and (Ohydroxamate, Ohydroxamate) type chelates seems probable with N-Me-Im-4-Cha. The imidazole is in β-position to the hydroxamic moiety in Im-4-Aha and an intermolecular noncovalent (mainly H-bonding) interaction seems to organize the intermediate-protonated molecules in this system. Following the formation of mono- and bishydroxamato mononuclear complexes, only EPR silent species exists in the Fe(III)-Hisha system above pH 4, what suggests the rather significant “assembler activity” of the imidazole (perhaps together with the ammonium moiety)
    corecore